Optimal Matrix Transposition and Bit Reversal on Hypercubes: All-to-All Personalized Communication
نویسنده
چکیده
In a hypercube multiprocessor with distributed memory, messages have a street address and an apartment number, i.e., a hypercube node address and a local memory address. Here we describe an optimal algorithm for performing the communication described by exchanging the bits of the node address with that of the local address. These exchanges occur typically in both matrix transposition and bit reversal for the fast Fourier transform.
منابع مشابه
All-to-All Personalized Communication on Circuit Switched Hypercubes
The all-to-all personalized communication is a massive data movement operation that arises frequently in problems like large matrix transposition on hypercube computers. In literature, various researchers have proposed routing methods to solve this problem using multiport packet switching communication, which is not practical. In this paper, we present a simple algorithm to solve this routing p...
متن کاملOn the limits of cache-oblivious rational permutations
Permuting a vector is a fundamental primitive which arises in many applications. In particular, rational permutations, which are defined by permutations of the bits of the binary representations of the vector indices, are widely used. Matrix transposition and bit-reversal are notable examples of rational permutations. In this paper we contribute a number of results regarding the execution of th...
متن کاملOptimal All-to-Some Personalized Communication on Hypercubes
In a hypercube multiprocessor with distributed memory, each data element has a street address and an apartment number (i.e. a hypercube node address and a local memory address). We describe an optimal algorithm for performing the all-to-some personalized communication (ASPC) on Boolean n-cubes, defined as (ijj) ! (i 2j jj), i 2 [0; 2n 1], j 2 [0; n 1], where (ijj) denote the data element on nod...
متن کاملTransposing Arrays on Multicomputers Using de Bruijn Sequences
Transposing an N × N array that is distributed rowor column-wise across P = N processors is a fundamental communication task that requires time-consuming interprocessor communication. It is the underlying communication task for the fast Fourier transform of long sequences and multi-dimensional arrays. It is also the key communication task for certain weather and climate models. A parallel trans...
متن کاملTime and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented N node hypercubes. First we generalize a technique, introduced in [3], for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in [7] whether O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 11 شماره
صفحات -
تاریخ انتشار 1991